ar X iv : q ua nt - p h / 04 11 09 3 v 1 1 2 N ov 2 00 4 Optimal Experiment Design for Quantum State and Process Tomography and Hamiltonian Parameter Estimation ∗

نویسندگان

  • Robert L. Kosut
  • Ian Walmsley
  • Herschel Rabitz
چکیده

A number of problems in quantum state and system identification are addressed. Specifically, it is shown that the maximum likelihood estimation (MLE) approach, already known to apply to quantum state tomography, is also applicable to quantum process tomography (estimating the Kraus operator sum representation (OSR)), Hamiltonian parameter estimation, and the related problems of state and process (OSR) distribution estimation. Except for Hamiltonian parameter estimation, the other MLE problems are formally of the same type of convex optimization problem and therefore can be solved very efficiently to within any desired accuracy. Associated with each of these estimation problems, and the focus of the paper, is an optimal experiment design (OED) problem invoked by the Cramér-Rao Inequality: find the number of experiments to be performed in a particular system configuration to maximize estimation accuracy; a configuration being any number of combinations of sample times, hardware settings, prepared initial states, etc.. We show that in all of the estimation problems, including Hamiltonian parameter estimation, the optimal experiment design can be obtained by solving a convex optimization problem.1 Research supported by the DARPA QUIST Program. SC Solutions, Sunnyvale, CA, USA, [email protected] Oxford University, Oxford, UK, [email protected] Princeton University, Princeton, NJ, [email protected] 1Software to solve the MLE and OED convex optimization problems is available upon request from the first author.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : q ua nt - p h / 99 09 01 2 v 3 1 N ov 2 00 2 Analysis of Quantum Functions ∗

Quantum functions are functions that can be computed by means of quantum mechanical device. This paper investigates quantum functions that take classical bit inputs. We explore basic properties and close relationships among these quantum functions. We also discuss quantum functions that make adaptive and nonadaptive (or parallel) oracle queries. key words: quantum Turing machine, nonadaptive qu...

متن کامل

ar X iv : q ua nt - p h / 06 11 14 4 v 1 1 4 N ov 2 00 6 Geometrical structure of entangled states and secant variety

We show that the secant variety of the Segre variety gives useful information about the geometrical structure of an arbitrary multipartite quantum system. In particular, we investigate the relation between arbitrary bipartite and three-partite entangled states and this secant variety. We also discuss the geometry of an arbitrary general multipartite state.

متن کامل

ar X iv : q ua nt - p h / 02 11 09 1 v 1 1 5 N ov 2 00 2 Hidden Translation and Orbit Coset in Quantum Computing ∗

We give efficient quantum algorithms for HIDDEN TRANSLATION and HIDDEN SUBGROUP in a large class of non-abelian groups including solvable groups of bounded exponent and of bounded derived series. Our algorithms are recursive. For the base case, we solve efficiently HIDDEN TRANSLATION in Z p , whenever p is a fixed prime. For the induction step, we introduce the problem ORBIT COSET generalizing ...

متن کامل

ar X iv : q ua nt - p h / 04 11 02 9 v 1 4 N ov 2 00 4 A high - yield single photon source using gated spontaneous parametric down conversion

The construction of a single photon source using gated parametric fluorescence is reported with the measurement results of the photon number distribution. A beamlike twin-photon method is used in order to achieve high collection efficiency. The estimated probability P (1) to find a single photon in a collimated output pulse is 26.5 % at a repetition rate of 10 kHz when the effective quantum eff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008